Coherent differentiation

Abstract The categorical models of differential linear logic (LL) are additive categories and those the lambda-calculus left-additive because Leibniz rule which requires summation two expressions. This means that, as far LL concerned, these feature finite nondeterminism indeed languages essentially non-deterministic. We introduce a framework for differentiation does not require additivity is compatible with deterministic such coherence spaces probabilistic spaces.